On the membership problem for the {0, 1/2}-closure
نویسندگان
چکیده
In integer programming, {0, 1/2}-cuts are Gomory–Chvátal cuts that can be derived from the original linear system by using coefficients of value 0 or 1/2 only. The separation problem for {0, 1/2}-cuts is strongly NP-hard. We show that separation remains strongly NP-hard, even when all integer variables are binary. © 2011 Elsevier B.V. All rights reserved.
منابع مشابه
Testing membership in the {0, 1/2}-closure is strongly NP-hard, even for polytopes contained in the n-dimensional 0/1-cube
Caprara and Fischetti introduced a class of cutting planes, called {0, 1/2}-cuts, which are valid for arbitrary integer linear programs. They also showed that the associated separation problem is strongly NPhard. We show that separation remains strongly NP-hard, even when all integer variables are binary, even when the integer linear program is a set packing problem, and even when the matrix of...
متن کاملAn algorithm for determining common weights by concept of membership function
Data envelopment analysis (DEA) is a method to evaluate the relative efficiency of decision making units (DMUs). In this method, the issue has always been to determine a set of weights for each DMU which often caused many problems. Since the DEA models also have the multi-objective linear programming (MOLP) problems nature, a rational relationship can be established between MOLP and DEA problem...
متن کاملOn the Closure of Positive Flat Moment Matrices
Let y ≡ y(2d) = {yi}i∈Zn+ ,|i|62d denote a real n-dimensional multisequence of degree 2d, y0 > 0. Let Ly : R2d[x1, . . . , xn] 7→ R denote the Riesz functional, defined by Ly(∑|i|62d aix i) = ∑ aiyi, and let Md(y) denote the corresponding moment matrix. Positivity of Ly plays a significant role in the Truncated Moment Problem and in the Polynomial Optimization Problem, but concrete conditions f...
متن کاملRobustified distance based fuzzy membership function for support vector machine classification
Fuzzification of support vector machine has been utilized to deal with outlier and noise problem. This importance is achieved, by the means of fuzzy membership function, which is generally built based on the distance of the points to the class centroid. The focus of this research is twofold. Firstly, by taking the advantage of robust statistics in the fuzzy SVM, more emphasis on reducing the im...
متن کاملar X iv : 0 71 0 . 37 11 v 1 [ m at h . R A ] 1 9 O ct 2 00 7
We study the classes of languages defined by valence automata with rational target sets (or equivalently, regular valence grammars with rational target sets), where the valence monoid is drawn from the important class of polycyclic monoids. We show that for polycyclic monoids of rank 2 or more, such automata accept exactly the context-free languages. For the polycyclic monoid of rank 1 (that is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Oper. Res. Lett.
دوره 39 شماره
صفحات -
تاریخ انتشار 2011